Systolic Tree ! - Languages : The Operational andthe Logical
نویسندگان
چکیده
The class of !-languages recognized by systolic (binary) tree automata is introduced. That class extends the class of B uchi !-languages though maintaining the closure under union, intersection and complement and the decidability of emptiness. The class of systolic tree !-languages is characterized in terms of a (suitable) concatenation of ((nitary) systolic tree languages. A generalization of Bu chi Theorem is provided which establishes a correspondence between systolic tree !-languages and a suitable extension of the sequential calculus S1S.
منابع مشابه
A Logical Characterization of Systolic Languages
In this paper we study, in the framework of mathematical logic, L(SBTA) i.e. the class of languages accepted by Systolic Binary Tree Automata. We set a correspondence (in the style of B uchi Theorem for regular languages) between L(SBTA) and MSOSig], i.e. a decid-able Monadic Second Order logic over a suitable innnite signature Sig. We also introduce a natural subclass of L(SBTA) which still pr...
متن کاملAn operational and denotational approach to non-context-freeness
The main result of this paper is a description of linguisticallymotivated non-contextfree phenomena equivalently in terms of regular tree languages (to express the recursive properties) and both a logical and an operational perspective (to establish the intended linguistic relations). The result is exemplified with a particular noncontext-free phenomenon, namely cross-serial dependencies in nat...
متن کاملSystolic Tree !-Languages
The class of !-languages recognized by systolic tree automa-ta is introduced. That class extends the class of B uchi !-languages and is closed under boolean operations. The emptiness problem for systolic tree automata on innnite sequences is decidable. A characterization of sys-tolic tree !-languages in terms of a (suitable) concatenation of ((nitary) systolic tree languages is also provided.
متن کاملReasoning about BDI Agents from a Programming Languages Perspective
In this paper, we summarize an approach to reasoning about a class of BDI agent architectures based on PRS. The theory is formalized using a logic, Agent Dynamic Logic (ADL), that combines elements from Computation Tree Logic, Propositional Dynamic Logic and Rao and Georgeff’s BDI Logic. The motivation of this work is to develop a logical framework that is at once rigorous in providing formal n...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995